Picking the Amateur's Mind - Predicting Chess Player Strength from Game Annotations
نویسندگان
چکیده
Results from psychology show a connection between a speaker’s expertise in a task and the language he uses to talk about it. In this paper, we present an empirical study on using linguistic evidence to predict the expertise of a speaker in a task: playing chess. Instructional chess literature claims that the mindsets of amateur and expert players differ fundamentally (Silman, 1999); psychological science has empirically arrived at similar results (e.g., Pfau and Murphy (1988)). We conduct experiments on automatically predicting chess player skill based on their natural language game commentary. We make use of annotated chess games, in which players provide their own interpretation of game in prose. Based on a dataset collected from an online chess forum, we predict player strength through SVM classification and ranking. We show that using textual and chess-specific features achieves both high classification accuracy and significant correlation. Finally, we compare our findings to claims from the chess literature and results from psychology.
منابع مشابه
Predicting the Outcome of Chess Games based on Historical Data
This report describes an approach used in the competition “Chess Ratings – Elo versus the Rest of the World” that took place between August and November 2010. Using the Bradley-Terry model as starting point, we postulate that the strength of each player can be approximated by the expected score against a common but unknown reference player, whose strength is never actually computed. This approa...
متن کاملSmooth Chess
We will attempt to find a smooth version of the classical (discrete) game of chess. Defined rigorously below, a smooth version of a game is in some sense reminiscent of the probability distributions discussed in quantum mechanics, in the sense that a piece is not necessarily concentrated in one place, but distributed throughout the board. For example, if a player believes that there is a 30% ch...
متن کاملAbstracting Knowledge from Annotated Chinese-Chess Game Records
ing Knowledge from Annotated Chinese-Chess Game Records Bo-Nian Chen , Pangfang Liu, Shun-Chin Hsu, and Tsan-sheng Hsu 1 Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan {r92025,pangfeng}@csie.ntu.edu.tw 2 Department of Information Management, Chang Jung Christian University, Tainan, Taiwan [email protected] 3 Institute of Information Sc...
متن کاملResponse Time Distributions in Rapid Chess: A Large-Scale Decision Making Experiment
Rapid chess provides an unparalleled laboratory to understand decision making in a natural environment. In a chess game, players choose consecutively around 40 moves in a finite time budget. The goodness of each choice can be determined quantitatively since current chess algorithms estimate precisely the value of a position. Web-based chess produces vast amounts of data, millions of decisions p...
متن کاملChinese Dark Chess
Chinese dark chess is a popular and easy-to-learn game in Asia. The characteristic of possible revealing of unknown pieces makes it different from Chinese chess or Western chess. Players with luck may win a game by chance. Thus, there is a probabilistic behavior that a player has to consider. Computer Chinese dark chess problems can be divided into three phases: 1) the opening game, 2) the midd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014